Construction algorithms for rational cubic surfaces

Rational Points on Cubic Surfaces

Let k be an algebraic number eld and F (x0; x1; x2; x3) a non{singular cubic form with coeecients in k. Suppose that the pro-jective cubic k{surface X P 3 k given by F = 0 contains three coplanar lines deened over k, and let U (k) be the set of k{points on X which does not lie on any line on X. We show that the number of points in U (k), with height at most B, is OF;"(B 4=3+") for any " > 0.

Rational Parametrizations of Real Cubic Surfaces

Real cubic algebraic surfaces may be described by either implicit or parametric equations. Each of these representations has strengths and weaknesses and have been used extensively in computer graphics. Applications involving both representations include the efficient computation of surface intersections, and triangulation of curved surfaces. One particularly useful representation is the ration...

Construction of rational surfaces yielding good codes

In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound à la Weil of Aubry and Perret together with the bound of Homma and Kim for plane curves. The parameters of several codes from rational surfaces are computed. Am...

Geometric Information and Rational Parametrization of Nonsingular Cubic Blending Surfaces

The techniques for parametrizing nonsingular cubic surfaces have shown to be of great interest in recent years. This paper is devoted to the rational parametrization of nonsingular cubic blending surfaces. We claim that these nonsingular cubic blending surfaces can be parametrized using the symbolic computation due to their excellent geometric properties. Especially for the specific forms of th...

Construction of Rational Elliptic Surfaces with Mordell-Weil Rank 4